package com.mzy.linear_struct.hot100.动态规划;

import java.util.jar.JarEntry;

/**
 * @Author: mizy3
 * @Date: 2024/09/07/下午10:49
 * @Description:
 */
public class Pro583两个字符串的删除操作 {
    public int minDistance(String word1, String word2) {
        // dp[i][j] 表示i、j处的word1、word2要变成一样删除的次数
        int[][] dp = new int[word1.length() + 1][word2.length() + 1];

        for (int i = 1; i <= word1.length(); i++) {
            dp[i][0] = i;
        }
        for (int i = 1; i <= word2.length(); i++) {
            dp[0][i] = i;
        }

        for (int i = 1; i <= word1.length(); i++) {
            for (int j = 1; j <= word2.length(); j++) {
                if(word1.charAt(i - 1) == word2.charAt(j - 1)){
                    dp[i][j] = dp[i - 1][j - 1];
                }else {
                    dp[i][j] = Math.min(dp[i - 1][j] + 1, dp[i][j - 1] + 1);
                }
            }
        }

        return  dp[word1.length()][word2.length()];
    }

    public static void main(String[] args) {
        System.out.println(new Pro583两个字符串的删除操作().minDistance("sea", "eat"));
    }
}




























